leaf node
英 [liːf nəʊd]
美 [liːf noʊd]
网络 叶子结点; 叶子节点; 叶节点; 叶结点; 树叶节点
英英释义
noun
- (botany) the small swelling that is the part of a plant stem from which one or more leaves emerge
双语例句
- In the index tree, leaf node is storing the XML data.
索引树中的叶子节点存放着XML节点的数据。 - This method returns the children of the given tree node, or it returns null if the leaf tree node is encountered.
该方法返回给定树节点的子节点，或者如果遇到叶子节点，它返回null。 - Photosynthetic contribution of non-leaf organs above flag leaf node to grain yield accounted for 70%~ 80%, which increased with water supply decreasing or plant density increasing. 2.
在旗叶节以上器官对粒重的总贡献率中，非叶器官的贡献率所占比例达70～80%，随灌水减少、密度增大而增加。 - Meanwhile, by comparing the influences of water content of stem with leaf sheath, it could be founded that stem-leaf bond intensitys and water contents of leaf sheath had same change trend with node position. ( 3) Flattening decreased stem-leaf bond intensity of corn straw obviously.
比较茎秆含水率和叶鞘含水率分别对茎叶结合强度的影响发现，叶鞘含水率与茎叶结合强度随节位的变化趋势具有一致性。（3）压扁可明显减小玉米秸秆茎叶结合强度。 - Manilagrass was trampled by 4 trampling intensities in 3 courses. The internode length, the leaf length and the number of node will increase as the trampling intensities become stronger.
草坪草的茎节数、节间长度、叶片长度均是随践踏强度的增加而减少，重度践踏胁迫下，分别比对照减少20.1%、26.9%和33.4%。 - For each leaf node of each decision tree, the shift information of the local features to the object center ( offest) and the class information of these features, together with the class information of this leaf node are stored.
在决策树的每个叶子节点中，记录到达该节点的局部特征相对于目标中心的偏移量及其相应的类别信息、以及该叶子节点的类别信息。 - Furthermore, a new leaf node labeling method is proposed which considers the main class of training samples covered by the leaf node as its class label, and the relevance of classification results is quantified by associated confidence levels.
另外给出了确定叶子节点类标签的新方法，将叶子节点所覆盖训练样本的主要类别作为其类标签。最后提出了一个置信度函数对分类结果进行分析，给出分类结果的可信程度。 - Compared to traditional method, the improved method adds the leaf node path distance measurement, making the measure of sample similarity more precise.
与原始方法相比，改进方法增加了叶子节点路径距离的度量，更精确地度量了样本间的相似性。 - The central idea of improved B~+ tree algorithm is to allow the number of keys in non-leaf node is N times of leaf node.
改进B~+树算法的核心思想是让非叶子结点可含有的最多关键字个数是叶子结点的N倍。 - The third is all attributes from rote node to leaf node must be known.
ID3必须知道从叶子节点到树根的路径上所有内节点对应的属性的属性值。